Analysys of Elastic Traffic Effects on Wdm Dynamic Grooming

نویسندگان

  • Renato Lo Cigno
  • Elio Salvadori
  • Zoltan Zsóka
  • R. Lo Cigno
  • E. Salvadori
  • Z. Zsóka
چکیده

Traffic grooming in IP over WDM networks introduces a coupling between the optical layer and the IP layer. Grooming algorithms are normally studied with a very simple traffic model that completely ignores this interaction. This paper compares the performance of two simple grooming algorithms with a traditional, Poisson based traffic model and a more complex one that takes into account the IP traffic elasticity and the inherent interaction between the IP routing and the optical layer. Simulation results, supported by heuristic considerations and a very simple analytical model highlighting the interaction effects, show that ignoring the two layer interaction is not correct and may lead to wrong conclusions. Besides, it is shown that grooming algorithms that ignore the interaction between the IP and the optical routing, can lead to great resource waste, because the IP routing over the virtual, lightpath based topology, has no knowledge of the actual resource use, while the optical layer, when required to open a new lightpath ignores the overall traffic pattern, taking a decision that is based on a local optimum that may negatively affect later decisions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Traffic Grooming using Fixed-Alternate Routing in WDM Mesh Optical Networks

There is a mismatch between lightpath channel capacity and traffic request capacity in wavelength division multiplexed (WDM) optical mesh networks. Traffic grooming is needed to resolve this mismatch in an efficient way. We study the dynamic traffic grooming problem in WDM mesh networks using the fixed-alternate routing (FAR) approach. Based on the FAR approach, we propose the fixed-order groom...

متن کامل

Dynamic Multicast Traffic Grooming in WDM Networks with Reconfigurable Light-trees

We address the traffic grooming problem in WDM mesh networks with dynamic multicast traffic. We develop a grooming algorithm in which light-trees can dynamically be reconfigured when a new route is established. c © 2004 Optical Society of America OCIS codes: (060.4250) Networks

متن کامل

Metaheuristic Approaches to Traffic Grooming in Wdm Optical Networks

The widespread deployment of WDM optical networks posts lots of new challenges for network designers. Traffic grooming is one of the most common problems. Efficient grooming of traffic can effectively reduce the overall cost of the network. But unfortunately, traffic grooming problems have been shown to be NP-hard. Therefore, new heuristics must be devised to tackle them. Among these approaches...

متن کامل

Optimized Dynamic Traffic Grooming for Multicast Traffic in Optical WDM Networks

The dynamic traffic-grooming problem in wavelength routed networks is generally a two-layered routing problem in which traffic connections are routed over light paths in the virtual topology layer and light paths are routed over physical links in the physical topology layer. Traffic grooming for multicast communication in WDM networks has received very little attention to date. In this paper, w...

متن کامل

Inter - Semester 2011 Handout 13 1 5 Traffic Grooming inWavelength - RoutedWDMNet

In the last chapter, we assume that each source-destination (s-d) pair has its taffic demand equal to an integer multiple of wavelength unit. Accordingly, supporting such traffic in transparent wavelength division multiplexing (WDM) networks can be done by establishing lightpaths between s-d pairs. In addition, these established lightpaths will be fully utilized. In this chapter, we allow for s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004